Relationships Between Length and Coverage of Exact Decision Rules
نویسندگان
چکیده
The paper describes a new tool for study relationships between length and coverage of exact decision rules. This tool is based on dynamic programming approach. We also present results of experiments with decision tables from UCI Machine Learning Repository.
منابع مشابه
Application of Dynamic Programming Approach to Optimization of Association Rules Relative to Coverage and Length
In the paper, an application of dynamic programming approach to optimization of approximate association rules relative to the coverage and length is presented. It is based on the extension of dynamic programming approach for optimization of decision rules [1] to the case of inconsistent decision tables. Applications of rough sets theory to the construction of rules for knowledge representation ...
متن کاملExploring the Relationships between Spatial and Demographic Parameters and Urban Water Consumption in Esfahan Using Association Rule Mining
In recent years, Iran has faced serious water scarcity and excessive use of water resources. Therefore, exploring the pattern of urban water consumption and the relationships between geographic and demographic parameters and water usage is an important requirement for effective management of water resources. In this study, association rule mining has been used to analyze the data of municipal w...
متن کاملExact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملSequential Optimization of γ-Decision Rules
The paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to length, coverage and number of misclassifications. Presented algorithm constructs a directed acyclic graph ∆γ(T ) which nodes are subtables of the decision table T . Based on the graph ∆γ(T ) we can describe all irredundant γ-decision r...
متن کاملDynamic programming approach to optimization of approximate decision rules
This paper is devoted to the study of an extension of dynamic programming approach which allows sequential optimization of approximate decision rules relative to the length and coverage. We introduce an uncertainty measure R(T) which is the number of unordered pairs of rows with different decisions in the decision table T. For a nonnegative real number b, we consider b-decision rules that local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012